Combinatorics of / / / φ -
نویسندگان
چکیده
In order to extend the Schützenberger’s factorization to general perturbations, the combinatorial aspects of the Hopf algebra of the φ-deformed stuffle product is developed systematically in a parallel way with those of the shuffle product. and in emphasizing the Lie elements as studied by Ree. In particular, we will give an effective construction of pair of bases in duality.
منابع مشابه
Involutions Of Connected Binary Matroids
We prove that if an involution φ is an automorphism of a connected binary matroid M , then there is a hyperplane of M that is invariant under φ. We also consider extensions of this result for higher connectivity.
متن کاملEndomorphisms of Partially Ordered Sets
Let P be a partially ordered set. A function φ : P → P is an endomorphism of P if for every two elements x, y of P , the inequality φ(x) 6 φ(y) holds whenever x 6 y. Obviously, the identity mapping is a (trivial ) endomorphism. Here, however, we will be interested in endomorphisms with an image of size less than |P |, i.e. endomorphisms which are not automorphisms of P . We will refer to them a...
متن کاملDecycling sets in certain cartesian product graphs with one factor complete
A decycling set in a graph G is a set D of vertices such that G − D is acyclic. The decycling number of G, φ(G), is the cardinality of a smallest decycling set in G. We obtain sharp bounds on the value of the cartesian product φ(G Kr) when r ≥ 3 and prove that when G belongs to one of several well-known families of graphs, including bipartite graphs and graphs of maximum degree 3, then φ(G K3) ...
متن کاملOn the total edge irregularity strength of hexagonal grid graphs
An edge irregular total k-labeling of a graph G = (V,E) is a labeling φ : V ∪ E → {1, 2, . . . , k} such that the total edge-weights wt(xy) = φ(x) + φ(xy) + φ(y) are different for all pairs of distinct edges. The minimum k for which the graph G has an edge irregular total k-labeling is called the total edge irregularity strength of G. In this paper, we determined the exact values of the total e...
متن کامل2 HUGH THOMAS Theorem
We show that a certain orbit category considered by Keller encodes the combinatorics of the m-clusters of Fomin and Reading in a fashion similar to the way the cluster category of Buan, Marsh, Reineke, Reiten, and Todorov encodes the combinatorics of the clusters of Fomin and Zelevinsky. This allows us to give type-uniform proofs of certain results of Fomin and Reading in the simply laced cases...
متن کاملOn the super edge-magic deficiency of some families related to ladder graphs
A graph G is called edge-magic if there exists a bijective function φ : V (G)∪E(G) → {1, 2,. .. , |V (G)|+ |E(G)|} such that φ(x)+φ(xy)+φ(y) is a constant c(φ) for every edge xy ∈ E(G); here c(φ) is called the valence of φ. A graph G is said to be super edge-magic if φ(V (G)) = {1, 2,. .. , |V (G)|}. The super edge-magic deficiency, denoted by μ s (G), is the minimum nonnegative integer n such ...
متن کامل